Desert Automata I. A Burnside Problem and its Solution
نویسنده
چکیده
We introduce a new model of weighted automata: the desert automata. We show the decidability of the limitedness problem for desert automata by solving the underlying Burnside problem. As an application of this result, we give a positive solution to the so-called finite substitution problem which was open for more than 10 years: given recognizable languages K and L, decide whether there exists a finite substitution σ such that σ(K) = L. Short version is accepted at the 21st International Symposium on Theoretical Aspects of Computer (STACS’2004). Supported by the grant KI 822/1–1 of the German Research Community (Deutsche Forschungsgemeinschaft).
منابع مشابه
Desert Automata and the Finite Substitution Problem ⋆ ( Extended Abstract ) ⋆ ⋆ Daniel
We give a positive solution to the so-called finite substitution problem which was open for more than 10 years [11]: given recognizable languages K and L, decide whether there exists a finite substitution σ such that σ(K) = L. For this, we introduce a new model of weighted automata and show the decidability of its limitedness problem by solving the underlying Burnside problem.
متن کاملDistance Desert Automata and the Star Height One Problem
We show that it is decidable in time complexity 2 2O(n) whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star height one problem. To achieve this, we introduce distance desert automata as a joint generalization of distance automata and desert automata, and show the decidability of its limitedness pro...
متن کاملOn the Restricted Burnside Problem
After many unsuccessful attempts to obtain a proof in the late 30s-early 40s the following weaker version of The Burnside Problem was studied: Is it true that there are only finitely many 7??-generated finite groups of exponent nl In other words the question is whether there exists a universal finite m-generated group of exponent n having all other finite m-generated groups of exponent n as hom...
متن کاملA Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
The class of automaton groups is a rich source of the simplest examples of infinite Burnside groups. However, there are some classes of automata that do not contain such examples. For instance, all infinite Burnside automaton groups in the literature are generated by non reversible Mealy automata and it was recently shown that 2-state invertible-reversible Mealy automata cannot generate infinit...
متن کاملThe Problem of Customary Marriage and the Solution of Temporary Marriage
Customary marriage (nikāḥ ‘urfī)—non-official married life of a couple—is a new phenomenon increasingly spreading throughout the Arab world. Legal and social consequences of customary marriage have led many socio-jurisprudential scholars to forbid all its varieties. The strategy has, nevertheless, failed to restrain the spread of this type of marriage. In this paper, I argue that one f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004